Blind distributed estimation algorithms for adaptive networks
نویسندگان
چکیده
منابع مشابه
Blind distributed estimation algorithms for adaptive networks
Until recently, a lot of work has been done to develop algorithms that utilize the distributed structure of an ad hoc wireless sensor network to estimate a certain parameter of interest. However, all these algorithms assume that the input regressor data is available to the sensors, but this data is not always available to the sensors. In such cases, blind estimation of the required parameter is...
متن کاملDistributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...
متن کاملAdaptive Algorithms and Variable Structures for Distributed Estimation
The analysis and design of new non-centralized learning algorithms for potential application in distributed adaptive estimation is the focus of this thesis. Such algorithms should be designed to have low processing requirement and to need minimal communication between the nodes which would form a distributed network. They ought, moreover, to have acceptable performance when the nodal input meas...
متن کاملOnline Distributed Estimation via Adaptive Sensor Networks
The paper presents an online distributed estimation scheme over adaptive sensor networks. The objective of the algorithm is consistent with distributed least squares without prior assumptions on the uncertainties in the operating environment of the sensors or the quality of sensor observations. Specifically, it is assumed that the observation process is time-varying due to the sensor’s suscepti...
متن کاملAdaptive and distributed coordination algorithms for mobile sensing networks
Consider n sites evolving within a convex polygon according to one of the following interaction laws: (i) each site moves away from the closest other site or polygon boundary, (ii) each site moves toward the furthest vertex of its own Voronoi polygon, or (iii) each site moves toward a geometric center (centroid, circumcenter, incenter, etc) of its own Voronoi polygon. These interaction laws giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2014
ISSN: 1687-6180
DOI: 10.1186/1687-6180-2014-136